Polynomial space hardness without disjunction property
نویسندگان
چکیده
منابع مشابه
Polynomial space hardness without disjunction property
In [HT11], Horč́ık and Terui show that if a substructural logic enjoys the disjunction property, then its tautology problem is PSPACE-hard. We prove that all substructural logics in the interval between intuitionistic logic and generalized Hájek basic logic have a PSPACE-hard tautology problem, which implies that uncountably many substructural logics lacking the disjunction property have a PSPAC...
متن کاملA polynomial time complete disjunction property in intuitionistic propositional logic
We extend the polynomial time algorithms due to Buss and Mints[2] and Ferrari, Fiorentini and Fiorino[4] to yield a polynomial time complete disjunction property in intuitionistic propositional logic. The disjunction property, DP of the intuitionistic propositional logic Ip says that if a disjunction α0 ∨ α1 is derivable intuitionistically, then so is αi for an i. This property follows from cut...
متن کاملExclusive disjunction without implicature
For the purposes of this note, I will assume that the Gricean account of scalar implicature is correct. I admit that I don’t have any qualms about making this assumption, since as far as I can tell, the Gricean account is the only game in town. But I thought I should mention it. With this preliminary out of the way, let us proceed to the problem area, and start by considering the following exam...
متن کاملIntuitionistic implication without disjunction
We investigate fragments of intuitionistic propositional logic containing implication but not disjunction. These fragments are finite, but their size grows superexponentially with the number of generators. Exact models are used to characterize the fragments.
متن کاملDisjunction without Tears
It is now common practice to use structured sets of features to describe syntactic structures, and to compare such structured sets by some form of unification. It is extremely tempting to try to encode disjunctive information within this framework; unfortunately, general unification of disjunctive structures is NPcomplete, which is not a desirable property for the basic operation involved in co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.025